On Equivalence of Binary Asymmetric Channels regarding the Maximum Likelihood Decoding
نویسندگان
چکیده
This work concerns with the n-fold binary asymmetric channels (BACn). An equivalence relation between two channels can be characterized by both having the same decision criterion when maximum likelihood is considered. We introduce here a function S (the BAC-function) such that the parameters (p, q) of the binary channel which determine equivalent channels belong to certain region delimited by its level curves. Explicit equations determining these regions are given and the number of different BACn classes is determined. A discusion on the size of these regions is also presented.
منابع مشابه
Matched Metrics to the Binary Asymmetric Channels
In this paper we establish some criteria to decide when a discrete memoryless channel admits a metric in such a way that the maximum likelihood decoding coincides with the nearest neighbour decoding. In particular we prove a conjecture presented by M. Firer and J. L. Walker establishing that every binary asymmetric channel admits a matched metric.
متن کاملOn the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels
Most of the basic concepts of algebraic coding theory are derived for the memoryless binary symmetric channel. These concepts do not necessarily hold for time-varying channels or for channels with memory. However, errors in real-life channels seem to occur in bursts rather than independently, suggesting that these channels exhibit some statistical dependence or memory. Nonetheless, the same alg...
متن کاملOn-the-Fly Maximum-Likelihood Decoding of Raptor Codes over the Binary Erasure Channel
In this letter, we propose an efficient on-the-fly algorithm for maximum-likelihood decoding of Raptor codes used over the binary erasure channel. It is shown that our proposed decoding algorithm can reduce the actual elapsed decoding time by more than two-thirds with respect to an optimized conventional maximum-likelihood decoding. key words: raptor codes, on-the-fly decoding, maximum-likeliho...
متن کاملComparison of decoding algorithms of binary linear block codes in Rayleigh fading channels with dive - Electronics Letters
The word error probability of binary linear block codes is evaluated in Rayleigh fading channels with diversity reception far three decoding algorithms: error correction (EC), errorlerasure correction (EEC). and maximum likelihood (MLI soft decoding algorithms. The performance advantage of EEC over EC In the required average SNR decreases as the number of ditersity channels increases. The perfo...
متن کاملOn Universal Properties of Capacity-Approaching LDPC Ensembles
This paper provides some universal information-theoretic bounds related to capacity-approaching ensembles of low-density parity-check (LDPC) codes. These bounds refer to the behavior of the degree distributions of such ensembles, and also to the graphical complexity and the fundamental system of cycles associated with the Tanner graphs of LDPC ensembles. The transmission of these ensembles is a...
متن کامل